Procedure di Decisione Ibride per QBF Hybrid Evaluation Procedures for QBF
نویسنده
چکیده
In questo lavoro viene presentato un sistema per la valutazione e certificazione di formule proposizionali quantificate (QBFs) che si basa su un approccio ibrido al problema. Vengono considerate questioni attinenti all’integrazione di differenti filosofie di soluzione e il ruolo delle meta-euristiche nella composizione del sistema complessivo. We present a system designed to evaluate and certify Quantified Boolean Formulas (QBFs) by employing a hybrid approach to the problem. Issues in integrating different philosophies and the usage of meta-heuristics to compose the whole framework are addressed.
منابع مشابه
Model Checking with Quantified Boolean Formulas
Modern symbolic model checking techniques use Binary Decision Diagrams (BDD) and propositional satisfiability (SAT) decision procedures for checking validity and satisfiability of propositional Boolean formulas, which are used to encode sub-problems of symbolic model checking. Usage of propositional formulas imposes a potential exponential memory blow-up on the model checking algorithms due to ...
متن کاملPartial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
Quantified Boolean formulae offer a means of representing many propositional formula exponentially more compactly than propositional logic. Recent work on automating reasoning with QBF has concentrated on extending the Davis-Putnam procedure to handle QBF. Although the resulting procedures make it possible to evaluate QBF that could not be efficiently reduced to propositional logic (requiring w...
متن کاملExtracting and Validating Skolem/Herbrand Function-Based QBF Certificates
Quantified Boolean Formulas (QBF) allow succinct representations of many real-world problems, e.g., in formal verification, artificial intelligence, or computer-aided design of integrated circuits. Hence, for many practical instances of QBF efficient decision procedures are highly requested. However, in many applications of QBF, it is not sufficient to ”just” solve problems but necessary to pro...
متن کاملPartial Implicit Unfolding in the Davis - PutnamProcedure for
Quantiied Boolean formulae ooer a means of representing many propositional formula exponentially more compactly than propo-sitional logic. Recent work on automating reasoning with QBF has concentrated on extending the Davis-Putnam procedure to handle QBF. Although the resulting procedures make it possible to evaluate QBF that could not be eeciently reduced to propositional logic (requiring wors...
متن کاملEfficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
Recent solvers for quantified boolean formulas (QBF) use a clause learning method based on a procedure proposed by Giunchiglia et al. (JAIR 2006), which avoids creating tautological clauses. Recently, an exponential worst case for this procedure has been shown by Van Gelder (CP 2012). That paper introduced QBF Pseudo Unit Propagation (QPUP) for non-tautological clause learning in a limited sett...
متن کامل